Subset sum problem in polycyclic groups
نویسندگان
چکیده
We consider a group-theoretic analogue of the classic subset sum problem. It is known that every virtually nilpotent group has polynomial time decidable subset sum problem. In this paper we use subgroup distortion to show that every polycyclic non-virtually-nilpotent group has NP-complete subset sum problem.
منابع مشابه
A family of polycyclic groups over which the uniform conjugacy problem is NP-complete
In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we create polycyclic groups Gn whose conjugacy problem is at least as hard as the subset sum problem with n indeterminates. As such, the conjugacy problem over the groups Gn is NP-complete where the parameters of the problem are taken in terms of n and the length of the elements given on input.
متن کاملKnapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
In their paper [22], Myasnikov, Nikolaev, and Ushakov started the investigation of classical discrete integer optimization problems in general non-commutative groups. Among other problems, they introduced for a finitely generated (f.g.) group G the knapsack problem and the subset sum problem. The input for the knapsack problem is a sequence of group elements g1, . . . , gk, g ∈ G and it is aske...
متن کاملKnapsack Problems in Groups
We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time decidable in hyperbolic groups and give various examples of finitely presented groups where the subset sum problem is NP-complete.
متن کاملCounting subset sums of finite abelian groups
In this paper, we obtain an explicit formula for the number of zero-sum k-element subsets in any finite abelian group.
متن کاملKnapsack Problems for Wreath Products
In recent years, knapsack problems for (in general non-commutative) groups have attracted attention. In this paper, the knapsack problem for wreath products is studied. It turns out that decidability of knapsack is not preserved under wreath product. On the other hand, the class of knapsack-semilinear groups, where solutions sets of knapsack equations are effectively semilinear, is closed under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 84 شماره
صفحات -
تاریخ انتشار 2018